Preferential Attachment, Aging and Weights in Recommendation Systems

نویسندگان

  • Massimiliano Zanin
  • Pedro Cano
  • Òscar Celma
  • Javier M. Buldú
چکیده

In the present work, algorithms based on complex network theory are applied to Recommendation Systems in order to improve their quality of predictions. We show how some networks are grown under the influence of trendy forces, and how this can be used to enhance the results of a recommendation system, i.e. increase their percentage of right predictions. After defining a base algorithm, we create recommendation networks which are based on a histogram of user ratings, using therefore an underlying principle of preferential attachment. We show the influence of data aging in the prediction of user habits and how the exact moment of the prediction influences the recommendation. Finally, we design weighted networks that take into account the age of the information used to generate the links. In this way, we obtain a better approximation to evaluate the users’ tastes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fractional Dynamics of Network Growth Constrained by Aging Node Interactions

In many social complex systems, in which agents are linked by non-linear interactions, the history of events strongly influences the whole network dynamics. However, a class of "commonly accepted beliefs" seems rarely studied. In this paper, we examine how the growth process of a (social) network is influenced by past circumstances. In order to tackle this cause, we simply modify the well known...

متن کامل

سیستم پیشنهاد دهنده زمینه‌آگاه برای انتخاب گوشی تلفن همراه با ترکیب روش‌های تصمیم‌گیری جبرانی و غیرجبرانی

Recommender systems suggest proper items to customers based on their preferences and needs. Needed time to search is reduced and the quality of customer’s choice is increased using recommender systems. The context information like time, location and user behaviors can enhance the quality of recommendations and customer satisfication in such systems. In this paper a context aware recommender sys...

متن کامل

Three efficient algorithms for implementing the preferential attachment mechanism in Yule-Simon Stochastic Process

We describe how different optimized algorithms may be effective in implementing the preferential attachment mechanism in different cases. We analyze performances with respect to different values of some parameters related to the Yule process associated to the preferential attachment. We examine how performance scales with system size and provide extensive simulations to support our theoretical ...

متن کامل

Preferential attachment mechanism of complex network growth: "rich-gets-richer" or "fit-gets-richer"?

We analyze the growth models for complex networks including preferential attachment (A.-L. Barabasi and R. Albert, Science 286, 509 (1999)) and fitness model (Caldarelli et al., Phys. Rev. Lett. 89, 258702 (2002)) and demonstrate that, under very general conditions, these two models yield the same dynamic equation of network growth, dK dt = A(t)(K +K0), where A(t) is the aging constant, K is th...

متن کامل

Natural emergence of clusters and bursts in network evolution

Network models with preferential attachment, where new nodes are injected into the network and form links with existing nodes proportional to their current connectivity, have been well studied for some time. Extensions have been introduced where nodes attach proportionally to arbitrary fitness functions. However, in these models, attaching to a node always increases the ability of that node to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • I. J. Bifurcation and Chaos

دوره 19  شماره 

صفحات  -

تاریخ انتشار 2009